directed path
英 [dəˈrektɪd pɑːθ]
美 [dəˈrektɪd pæθ]
有向路径;有向通路
双语例句
- The term directed path, used in signal flow graphs, is identical to what we have called an elementary path.
信号流图中使用的有向路这个名词意义与以前定义的初等路一样。 - A similar book directed at fast doctors, fast hospital administrators and fast insurers might be the next welcome stride backward down the path.
一本由提倡“快速治疗”的医生、医院管理者和保险公司写的书也可能在另一方面受到欢迎。 - On Directed Hamilton Path s in Tournaments
竞赛图中的有向哈密顿路 - By making a few reasonable simplifying assumptions, VBL can simulate arbitrary sequences of biological reactions in short time. As an example, the paper demonstrates the DNA computing solution to Directed Hamilton Path Problem with VBL.
使用合理的简化假设，VBL能在较短时间内实现对任意序列DNA生物操作的仿真，如有向哈密顿路径问题的DNA计算解决方案仿真。 - After associating an imaging demand sequence with an imaging path of the directed graph, taking into account the characteristic of imaging scheduling, and evaluating the quality of the imaging path based on multiple optimization criteria dominance relation, an efficient criteria vector generation algorithm is proposed.
通过将成像需求序列对应为有向图中的成像路径，结合成像调度问题特点，基于多个优化准则使用支配关系对成像路径质量进行综合评价，提出有效准则矢量生成算法。 - The Condition of Existing Directed Path and Directed Cycle in Fuzzy Digraph
Fuzzy有向图中有向路及有向圈存在的条件 - In this paper, the focus is directed on the analysis and comparisons of existing online modeling approaches of the secondary path, and then some problems are presented.
通过对声振主动控制领域中的已有的误差通道在线辨识技术进行分析与比较，指出其各自的优缺点，并提出其中值得研究的若干问题，以期有助于今后的进一步深入研究。 - The algorithm makes use of the topological characteristic of imaging directed graph, updates the vertex labels according to time-order vertex select strategy, and achieves every efficient criteria vector and corresponding one Pareto optimal path.
利用成像有向图的拓扑特性，基于时间顺序顶点选择策略进行顶点标记更新，生成出有向图中所有的有效准则矢量及每个准则矢量对应的一条Pareto优化路径。 - A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.
若有向图D中任何两个顶点是互相可达的，则称D为强连通图。 - In this dissertation, the ideas of simulating directed Hamilton path problems by splicing systems are designed using their massive parallelism;
本文利用剪接系统的巨大并行性，首先设计了模拟有向哈密顿路问题的剪接系统； - In this paper, we introduce the concept of κ-path cover about the directed graph of matrix. With the help of the κ-path cover we obtain a new distribution theorem on eigenvalues of matrix, and improve the classical Brauer's theorem.
本文引进了矩阵有向图的κ-path覆盖概念，借此给出一个新的特征值分布定理，改进了经典的Brauer定理； - On the basis of adjacency matrix of directed graph, the characteristics of this type of matrix is analyzed, and thereby the paper gives a new algorithm to convert the adjacency matrix to path matrix directly, and presents a study on this algorithm.
在已知有向图的邻接矩阵的基础上，分析邻接矩阵的特点，从而给出了一种直接由邻接矩阵求解路径矩阵的新算法，并对其算法进行了分析和研究。 - The adjacency matrix of a Fuzzy digraph is defined. The condition Separating directed path from directed walk is studied, and the existing condition of directed cycle and directed Hamilton cycle in Fuzzy Digraph are studied by discussing the power of the adjacency matrix.
对Fuzzy有向图定义了邻接矩阵，并通过对邻接矩阵幂的讨论，探讨了Fuzzy有向图中从有向途径中分离有向路的条件，有向圈及有向Hamilton圈存在的条件。 - This thesis is directed against the superiority and insufficient about network minimum path algorithm. A new algorithm for network minimum path problem& mixed-steps network roam method was studied.
本文针对现有网络最短路算法的优势与不足，提出了网络最短路问题的一种新算法&混合步长网络漫游法。 - When unidirectional circuit exists in a network, the matrix algorithm for path and the search in directed graph will fail, formula for path number and the plotting of equilibrium graph don't fit too.
流体网络中含有单向回路时，将会导致通路的矩阵算法以及有向图的搜索失败，计算通路数的公式、平衡图的绘制方法也不适用。 - A new power flow tracing method based on directed path
基于有向通路的潮流跟踪新方法 - Analysis for Directed Hamilton Path Problems Based on Splicing Systems
基于剪接系统的有向哈密顿路问题分析 - For any two vertices u and v in oriented graph D, a u-v geodesic is a shortest directed path from u to v.
对定向图D中的任意两点u，v，称连接点u，v的最短有向路为u&v测地线。 - The mathematical induction is a method of proof often applied in mathematics. The most common and the most famous inductive way is the simple directed path.
数学归纳法是数学中常常用到的一种证明方法，最常见而最为人们所熟知的归纳途径是简单的有向路。 - The Binary Directed Graph and Its Path Traversal Algorithm
二叉有向图及其路径遍历算法 - On sum up the foundation of a real project, put forward based on being directed against railway two stations the shortest path algorithm on the algorithm of Dijkstra.
在总结了一个实际工程项目开发的基础上，提出了一种基于Dijkstra算法上的针对铁路中两站点最优路径算法。 - The ideas of simulating directed Hamilton path problems by splicing systems are showed;
首先给出了剪接系统模拟有向哈密顿路问题的思想； - Then some properties of directed graphs and sufficiency and necessity conditions of existing Hamilton paths in graphs are presented based on the analysis to directed Hamilton path problems according to the properties of languages generated by the splicing systems.
然后通过此剪接系统所产生语言的性质对有向哈密顿路问题进行分析，给出了有向图的若干结构性质以及图中存在有向哈密顿路的充要条件。 - Aiming at the all-pairs shortest-path problem in the directed graph, a practical parallel algorithm, which based on the Floyd algorithm with an extended path array, was brought forward on 2-D mesh network.
针对有向图中每对顶点之间的最短路径问题，在基于扩充了路径矩阵的串行Floyd算法上，提出了二维网格结构上的并行算法。 - The scene design has been finished by directed acyclic graph, the library of shape-steel which can be maintained is established and the path planning of cutting is carried out.
采用有向无环图完成了型钢切割的场景设计，建立了可维护的型钢类型库，并且进行了切割的路径规划。 - The experiments show that the memory coloring based framework could efficiently exploit reuse and parallelism, without introducing spills. ( 3) Proposes an optimal directed path searching based stream register file allocation algorithm.
实验表明基于存储器着色的SRF分配框架能够在不引入溢出的前提下，有效地开发复用和并行。（3）提出了基于最佳有向路径寻找的流寄存器文件分配算法。 - A branch of the qualitative diagnosis& Signed Directed Graph ( SDG) is a root cause analysis, which could reveal fault propagation path, and implement depth analysis and diagnosis of complex failure scenario conveniently.
定性故障诊断的一个分支&符号有向图（signeddirectedgraph，简称SDG），是一种根原因分析方法，用于揭示故障传播路径，即剧情，便于实施复杂故障剧情的深度分析和诊断。 - How to solve the dilemma? Directed at the contradictions in the third part, which path to select in our country was analyzed in the concluding part.
如何解决矛盾？结语部分针对第三部分提出的矛盾对于我国的路径选择进行了探析。 - For the first time, we formalize the SRF allocation into optimal directed path searching, give a novel SRF allocation algorithm.
本文首次将SRF分配问题建模为最佳有向路径寻找问题，提出了一个新颖的SRF分配算法。 - This method will extract all of the possible phrases from a segmented sentence, build a directed acyclic graph and compute the shortest path, so as to improve the accuracy of phrase segmentation.
本方法对于一个已经分词的句子，根据短语库找到这个句子中所有可能的短语，并构造有向无环图，求得最优路径，从而提高了短语切分的正确率。